<!DOCTYPE html>
<html>
	<head>
		<meta charset="UTF-8">
		<title>斐波那契</title>
	</head>
	<body>
		<script>
				<!--阶乘-->
		        <!--js递归的方式，取得斐波那契数列-->
		
		
		        function fbnq(n) {
		            if (n == 1 || n == 2){
		                return 1;
		            }else {
		                return fbnq(n-1) + fbnq(n-2);
		            }
		        }
		        console.log(fbnq(25));
		        
		</script>
	</body>
</html>
